Weak Containment and Weak Frobenius Reciprocity
نویسندگان
چکیده
منابع مشابه
Weak Containment and Rokhlin Entropy
We define a new notion of weak containment for joinings, and we show that this notion implies an inequality between relative Rokhlin entropies. This leads to new upper bounds to Rokhlin entropy. We also use this notion to study how Pinsker algebras behave under direct products, and we study the Rokhlin entropy of restricted actions of finite-index subgroups.
متن کاملz-weak ideals and prime weak ideals
In this paper, we study a generalization of z-ideals in the ring C(X) of continuous real valued functions on a completely regular Hausdorff space X. The notion of a weak ideal and naturally a weak z-ideal and a prime weak ideal are introduced and it turns out that they behave such as z-ideals in C(X).
متن کاملWeak hyper semi-quantales and weak hypervalued topological spaces
The purpose of this paper is to construct a weak hyper semi-quantale as a generalization of the concept of semi-quantale and used it as an appropriate hyperlattice-theoretic basis to formulate new lattice-valued topological theories. Based on such weak hyper semi-quantale, we aim to construct the notion of a weak hypervalued-topology as a generalized form of the so-called lattice-valued t...
متن کاملWeak containment of measure preserving group actions
This paper is a contribution to the study of the global structure of measure preserving actions of countable (discrete) groups on non-atomic standard probability spaces. For such a group Γ and space (X,μ), we let A(Γ, X, μ) be the space of measure preserving actions of Γ on (X,μ). In the book [K] a hierarchical notion of complexity of such actions, called weak containment, was introduced, motiv...
متن کاملWeak Parity Games and Language Containment of Weak Alternating Parity Automata
Optimisations of the state space of weak alternating parity automata (WAPA) are needed for example to speed up μTL model-checking algorithms which involve WAPA. It is assumed that deciding language containment for WAPA is helpful to perform such optimisations. In this paper the problem of language containment is reduced to the problem of computing winning sets in weak parity games. For the latt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1976
ISSN: 0002-9939
DOI: 10.2307/2040832